Towards a Decidable LogicWeb via Length-Bounded Derivations
نویسندگان
چکیده
LogicWeb has traditionally lacked devices for dealing with intractable queries. We address this limitation by adopting length-bounded inference, a form of approximate reasoning. A length-bounded inference is of the form pv(P, G, n) which is a success if a query G can be proved from the web page P within n proof steps. It thus makes LogicWeb decidable and more tractable. During the process, we propose a novel module language for logic programming as a device for structuring programs and queries. key words: module language, semantic web, length-bounded reasoning, approximate reasoning.
منابع مشابه
On the stability of generalized derivations on Banach algebras
We investigate the stability of generalizedderivations on Banach algebras with a bounded central approximateidentity. We show that every approximate generalized derivation inthe sense of Rassias, is an exact generalized derivation. Also thestability problem of generalized derivations on the faithful Banachalgebras is investigated.
متن کاملPattern Language Recognition and Generation
A k-bounded recognizable pattern language is the set of all k-bounded patterns that are obtained as behaviors of a pattern automaton. The emptiness and the equality problems for k-bounded behaviors of pattern automata are proved to be decidable. Moreover, we examine their relationship with context free pattern grammars, which are basically the hyperedge replacement grammars on planar directed a...
متن کاملLie higher derivations on $B(X)$
Let $X$ be a Banach space of $dim X > 2$ and $B(X)$ be the space of bounded linear operators on X. If $L : B(X)to B(X)$ be a Lie higher derivation on $B(X)$, then there exists an additive higher derivation $D$ and a linear map $tau : B(X)to FI$ vanishing at commutators $[A, B]$ for all $A, Bin B(X)$ such that $L = D + tau$.
متن کاملLeft Jordan derivations on Banach algebras
In this paper we characterize the left Jordan derivations on Banach algebras. Also, it is shown that every bounded linear map $d:mathcal Ato mathcal M$ from a von Neumann algebra $mathcal A$ into a Banach $mathcal A-$module $mathcal M$ with property that $d(p^2)=2pd(p)$ for every projection $p$ in $mathcal A$ is a left Jordan derivation.
متن کاملSecure Prolog Based Mobile Code
LogicWeb mobile code consists of Prolog-like rules embedded in Web pages, thereby adding logic programming behaviour to those pages. Since LogicWeb programs are downloaded from foreign hosts and executed locally, there is a need to protect the client from buggy or malicious code. A security model is crucial for making LogicWeb mobile code safe to execute. This paper presents such a model, which...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/1701.03615 شماره
صفحات -
تاریخ انتشار 2017